Battery Grouping with Time Series Clustering Based on Affinity Propagation
نویسندگان
چکیده
Battery grouping is a technology widely used to improve the performance of battery packs. In this paper, we propose a time series clustering based battery grouping method. The proposed method utilizes the whole battery charge/discharge sequence for battery grouping. The time sequences are first denoised with a wavelet denoising technique. The similarity matrix is then computed with the dynamic time warping distance, and finally the time series are clustered with the affinity propagation algorithm according to the calculated similarity matrices. The silhouette index is utilized for assessing the performance of the proposed battery grouping method. Test results show that the proposed battery grouping method is effective.
منابع مشابه
An Improved Dynamic Based Incremental Clustering in Affinity Propagation
Affinity propagation based clustering algorithm will be individually placed on each and every object Specific cluster. Utilizing the subsequent clustering technique. Affinity Propagation (AP) clustering continues to be proven to work in many of clustering problems. This particular paper views the best way to utilize AP in incremental clustering problems. Firstly, we mention the problems within ...
متن کاملComparison of Accuracy of Affinity Propagation Method and Cluster Ensembles Based on Co-occurrence Matrix
High accuracy of results is a very important task in any grouping problem (clustering). It determines effectiveness of the decisions based on them. Therefore in the literature there are proposed methods and solutions whose main aim is to give more accurate results than traditional clustering algorithms (e.g. k-means or hierarchical methods). Examples of such solutions can be cluster ensembles o...
متن کاملA Hybrid Time Series Clustering Method Based on Fuzzy C-Means Algorithm: An Agreement Based Clustering Approach
In recent years, the advancement of information gathering technologies such as GPS and GSM networks have led to huge complex datasets such as time series and trajectories. As a result it is essential to use appropriate methods to analyze the produced large raw datasets. Extracting useful information from large data sets has always been one of the most important challenges in different sciences,...
متن کاملAn Efficient Text Clustering Approach using Affinity Propagation with weight modification
Recently the text mining has emerged as one of the most important fields of data mining because of most of the searching in the web is done on the basis of provided text, also the increasing use of social web network uses the text as major component and extracting the effective information directly or indirectly requires an efficient grouping algorithm which should be capable of providing effic...
متن کاملDistributed Clustering in Cognitive Radio Ad Hoc Networks Using Soft-Constraint Affinity Propagation
Absence of network infrastructure and heterogeneous spectrum availability in cognitive radio ad hoc networks (CRAHNs) necessitate the self-organization of cognitive radio users (CRs) for efficient spectrum coordination. The cluster-based structure is known to be effective in both guaranteeing system performance and reducing communication overhead in variable network environment. In this paper, ...
متن کامل